EXPLICIT EQUATIONS OF STATE OF QUEUEING SYSTEM, REPRESENTED BY FINITE STATE MACHINE
نویسندگان
چکیده
منابع مشابه
State Assignment for Finite State Machine Synthesis
This paper proposes simulated annealing based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipation. The algorithm has two annealing stages. In the first rough annealing stage it tries to search in global scope by the proposed rough search method. In the second focusing annealing stage it tries to search in local sco...
متن کاملA Comparison of Succinctly Represented Finite-State Systems
We study the succinctness of different classes of succinctly presented finite transition systems with respect to bisimulation equivalence. Our results show that synchronized product of finite automata, hierarchical graphs, and timed automata are pairwise incomparable in this sense. We moreover study the computational complexity of deciding simulation preorder and bisimulation equivalence on the...
متن کاملFinite state machine for mutation
In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state machines. The mutation is studied systematically and an automaton have been constructed with the b...
متن کاملTranslatable Finite State Time Machine
The paper describes syntax, behavior and formal semantics of a new class of timed automata, which are tailored for modeling the behavior of real-time systems. A formal method for automatic generation of programs is developed around this model. The method starts from modeling the desired behavior of the system under design by means of a UML-based state machine with the ability to measure time, a...
متن کاملDetection of Equivalent State Variables in Finite State Machine Verification
This paper proposes a new technique to detect equivalent state variables for finite state machine verification. The technique can easily be integrated with existing verification methods and significantly extends the ability of these methods to handle finite state machines (FSMs) with similar state encodings. This is of practical importance as it enlarges the class of FSMs for which verification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vestnik of Samara University. Natural Science Series
سال: 2017
ISSN: 2541-7525
DOI: 10.18287/2541-7525-2013-19-9.1-94-101